Regular grammar

The equivalent relation and transformation method of regular grammar , nfa , dfa , state transition diagram and regular expression

正规文法、NFA、DFA、状态转换图、正规式之间的等价变换关系及变换方法

In the light of regular grammar , we studied a method of morphology analysis , proved its completeness , and offered the algorithm to realize the program .

在正规文法的基础上研究了一个基于线性归结的词法分析方法的原理，证明了该方法的完备性，并予以算法和程序的实现。

A decision method about equivalence of regular grammar

正则文法的一种等价性判别法

A note on minimum regular grammar and minimum nondeterministic finite automata

关于最小正则文法和最小不确定有限自动机的一点注记

Transferred epithet is a linguistic phenomenon which betrays the regular grammar .

移就，是一种违背传统语法的语言现象。

The paper describes symbolic structure of word of program language with regular grammar and regular expression , constructs converted-state chart to identify word symbol .

用正规文法和正规表达式描述了程序语言的单词符号的结构，用状态转换图构造了识别单词符号。

The realization process from freehand state transition diagram to regular grammar shows that the graphics / character separation algorithm is reliable and the framework of semantic understanding is feasible and accurate .

手绘有限状态转移图的文法表示实现过程验证了图文分离算法的可靠性和图形语义理解框架的可行性与正确性。

The transferring of descriptive modifiers in rhetoric is a betrayal of the regular grammar , but a breaking out of the stable , traditional grammatical patterns .

移就对常规语法具有背叛性，是对稳定的、传统的语法模式的一种突破。

Lattice-valued regular grammar . We propose the concept of lattice-valued ( hyper - ) regular grammar as well as lattice-valued ( hyper - ) regular language .

格值正则文法的研究：首先，提出了格值（超）正则文法的概念，并给出了格值（超）正则语言的定义，同时给出了两个格值文法等价的刻画。

In this paper , we mainly introduce the grammar structures and the computation methods of DNA sticker model , discuss the computational capacity of several DNA sticker models , and prove the equipollence of DNA finite automata and regular grammar .

本文主要介绍DNA分子粘接计算模型的文法结构和计算方法，探讨了不同粘接计算模型的计算能力，并证明了DNA有穷自动机与正规文法的等价性。

To the form language , the thesis use regular tree grammar to describe form grammar and analyze validation algorithm , others use XML Schema to define form grammar of xml format .

对表单语言采用正则树描述表单语法和分析验证算法，另外采用XMLSCHEMA定义表单的XML格式。

Many basic concepts and algorithms , such as finite automata , regular expression , context-free grammar , operator precedence algorithm , Reverse Polish Expression , etc , are be introduced and given the appropriate instance to illustrate .

同时介绍了有穷状态机，正则表达式，上下文无关文法，算符优先算法，逆波兰式等基本概念及算法，并给出了适当的实例加以说明。

The Relation between Fuzzy Regular Language and Fuzzy Regular Grammar

Fuzzy正则语言与Fuzzy正则文法的关系

It is also shown that , for any integer c ≥ 2 , there is always a regular language which possesses the characteristics c and can be generated by a regular grammar containing [ ( Iog2c ) - 1 ] variables . For secondary characteristics there exist similar facts .

并且证明了，对任意整数c>2，常存在这样的正则语言，此语言具特征标c，并恰能被一个含变量个数为[（log2c）-1]的正则文法生成。

Has adopted regular engine technology of attacking , invade characteristic mode and describe languages and corresponding regular machine that explains grammar after defining one set .

采用了攻击规则引擎技术，定义了一套入侵特征模式描述语言及相应的规则语法解释器。